Successive Approximation Method for Solving Wu-Zhang Systems of (1 1) Dimensional
نویسندگان
چکیده
منابع مشابه
A Novel Successive Approximation Method for Solving a Class of Optimal Control Problems
This paper presents a successive approximation method (SAM) for solving a large class of optimal control problems. The proposed analytical-approximate method, successively solves the Two-Point Boundary Value Problem (TPBVP), obtained from the Pontryagin's Maximum Principle (PMP). The convergence of this method is proved and a control design algorithm with low computational complexity is present...
متن کاملA METHOD FOR SOLVING FUZZY LINEAR SYSTEMS
In this paper we present a method for solving fuzzy linear systemsby two crisp linear systems. Also necessary and sufficient conditions for existenceof solution are given. Some numerical examples illustrate the efficiencyof the method.
متن کاملA Successive Minima Method for Implicit Approximation
This paper is concerned with the problem of approximating a collection of unorganized data points by an algebraic tensor-product B-spline curve. The implicit approximation to data points would be ideally based on minimizing the sum of squares of geometric distance. Since the geometric distance from a point to an implicit curve cannot be computed analytically, Sampson distance, which is the firs...
متن کاملHierarchical low-rank approximation of tensors by successive rank one corrections for preconditioning and solving high dimensional linear systems
We propose an algorithm for preconditioning and solving high dimensional linear systems of equations in tensor format. The algorithm computes an approximation of a tensor in hierarchical Tucker format in a subspace constructed from successive rank one corrections. The algorithm can be applied for the approximation of a solution or of the inverse of an operator. In the latter case, properties su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: OALib
سال: 2020
ISSN: 2333-9721,2333-9705
DOI: 10.4236/oalib.1106601